On Expressible Sets of Geometric Sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Thin Sets of Primes Expressible as Sumsets

In this paper we will use the following notation. Given a set of positive integers S, we let S(x) denote the number of elements in S that are ≤ x, and we let |S| denote the total number of elements of S. Given two sets of positive integers A and B, we denote the sumset {a + b : a ∈ A, b ∈ B} by A + B; and so, the number of elements in A + B that are ≤ x will be (A + B)(x). For a finite set of i...

متن کامل

Wijsman Statistical Convergence of Double Sequences of Sets

In this paper, we study the concepts of Wijsman statistical convergence, Hausdorff statistical convergence and  Wijsman statistical Cauchy double sequences of sets and investigate the relationship between them.

متن کامل

Expressible Semantics for Expressible Counterfactuals

Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources). I define a natural, restricted version of premise semantics, expressible premise semantics, which is based on ordering sources containing onl...

متن کامل

On sequences without geometric progressions

Several papers have investigated sequences which have no k-term arithmetic progressions, finding bounds on their density and looking at sequences generated by greedy algorithms. Rankin in 1960 suggested looking at sequences without k-term geometric progressions, and constructed such sequences for each k with positive density. In this paper we improve on Rankin’s results, derive upper bounds, an...

متن کامل

On an Algebraic Classification of Multidimensional Recursively Enumerable Sets Expressible in Formal Arithmetical Systems

Algebraic representations of multidimensional recursively enumerable sets which are expressible in formal arithmetical systems based on the signatures ) , , , 0 (   S , ) , , , 0 ( S   , ) , , 0 ( S  , where 1 ) (   x x S , are introduced and investigated. The equivalence is established between the algebraic and logical representations of multidimensional recursively enumerable sets expr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Functiones et Approximatio Commentarii Mathematici

سال: 2008

ISSN: 0208-6573

DOI: 10.7169/facm/1229696555